翻訳と辞書
Words near each other
・ Quantum nondemolition measurement
・ Quantum nonlocality
・ Quantum number
・ Quantum of Solace
・ Quantum of Solace (disambiguation)
・ Quantum of Solace (soundtrack)
・ Quantum on the Bay
・ Quantum operation
・ Quantum optics
・ Quantum oscillations (experimental technique)
・ Quantum paraelectricity
・ Quantum pendulum
・ Quantum Pharmaceutical
・ Quantum phase estimation algorithm
・ Quantum phase transition
Quantum complexity theory
・ Quantum compression
・ Quantum computing
・ Quantum concentration
・ Quantum configuration space
・ Quantum contextuality
・ Quantum Conundrum
・ Quantum convolutional code
・ Quantum Corporation
・ Quantum correlation
・ Quantum cosmology
・ Quantum coupling
・ Quantum critical point
・ Quantum cryptography
・ Quantum cylindrical quadrupole


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Quantum complexity theory : ウィキペディア英語版
Quantum complexity theory
Quantum complexity theory is a part of computational complexity theory in theoretical computer science. It studies complexity classes defined using quantum computers and quantum information which are computational models based on quantum mechanics. It studies the hardness of problems in relation to these complexity classes, and the relationship between quantum complexity classes and classical (i.e., non-quantum) complexity classes.
A complexity class is a collection of problems which can be solved by some computational model under resource constraints. For instance, the complexity class P is defined to be the set of problems solvable by a Turing machine in polynomial time. Similarly, one may define a quantum complexity class using a quantum model of computation, such as a standard quantum computer or a quantum Turing machine. Thus, the complexity class BQP is defined to be the set of problems solvable by a quantum computer in polynomial time with bounded error.
Two important quantum complexity classes are BQP and QMA which are the bounded-error quantum analogues of P and NP. One of the main aims of quantum complexity theory is to find out where these classes lie with respect to classical complexity classes such as P, NP, PP, PSPACE and other complexity classes.
==Quantum Query Complexity==
In the query complexity model, the input is given as an oracle (black box). The algorithm gets information about the input only by querying the oracle. The algorithm starts in some fixed quantum state and the state evolves as it queries the oracle.
Quantum Query Complexity is the smallest number of queries to the oracle that are required in order to calculate the function. Clearly, Quantum Query Complexity is a lower bound on the overall time complexity of a function.
An example depicting the power of Quantum Computing is Grover's algorithm for searching unstructured databases. Its Quantum Query Complexity is ''O''(''N''1/2) which is quadratically better than the best known classical query complexity.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Quantum complexity theory」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.